A Random Constraint Satisfaction Problem That Seems Hard for DPLL
نویسنده
چکیده
This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so is easier to analyze. For example, the exact satisfiability threshold for this problem is known, and the problem has high resolution complexity. In this paper, we prove the problem appears hard for DPLL. Specifically, if we pick a problem instance at random with constraint density higher than some given threshold but below the satisfiability threshold, a DPLL backtracking algorithm using the unit clause heuristic will, with uniformly positive probability, take exponential time to find a satisfying assignment.
منابع مشابه
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
This paper discusses a model of constraint satisfaction problems known as uniquely extendible constraint satisfaction problems. This model includes and generalizes XOR-SAT, and the model includes an NP-complete problem that appears to share many of the threshold characteristics of random SAT. In this paper we find an exact threshold in the behavior of two versions of DPLL on random instances of...
متن کاملGenerating Hard Satisfiable Formulas by Hiding Solutions Deceptively
To test incomplete search algorithms for constraint satisfaction problems such as 3-SAT, we need a source of hard, but satisfiable, benchmark instances. A simple way to do this is to choose a random truth assignment A, and then choose clauses randomly from among those satisfied by A. However, this method tends to produce easy problems, since the majority of literals point toward the “hidden” as...
متن کاملPhase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effort to extend this line of research to random instances of intractable parameterized problems. We propose random models for a representative intractable parameterized problem, the weighted d-CNF satisfiability, and its g...
متن کاملFrom k-SAT to k-CSP: Two Generalized Algorithms
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause length k (k-SAT) can be classified into three styles: DPLL-like, PPSZ-like and Local Search, with local search algorithms having already been generalized to C...
متن کاملUniversal Factor Graphs for Every NP-Hard Boolean CSP
An instance of a Boolean constraint satisfaction problem can be divided into two parts. One part, that we refer to as the factor graph of the instance, specifies for each clause the set of variables that are associated with the clause. The other part, specifies for each of the given clauses what is the constraint that is evaluated on the respective variables. Depending on the allowed choices of...
متن کامل